Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 29 May 2020Accepted: 28 September 2021Published online: 13 December 2021Keywordsspace complexity, derandomization, expander graphs, spectral sparsification, random walks, Laplacian systemsAMS Subject Headings68Q25Publication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: smjcat
منابع مشابه
Solving Laplacian Systems in Logarithmic Space
We investigate the space complexity of solving linear systems of equations. While all known deterministic or randomized algorithms solving a square system of n linear equations in n variables require Ω(log 2 n) space, Ta-Shma (STOC 2013) recently showed that on a quantum computer an approximate solution can be computed in logarithmic space, giving the first explicit computational task for which...
متن کاملProbabilistic Logarithmic-Space Algorithms for Laplacian Solvers
A recent series of breakthroughs initiated by Spielman and Teng culminated in the construction of nearly linear time Laplacian solvers, approximating the solution of a linear system Lx = b, where L is the normalized Laplacian of an undirected graph. In this paper we study the space complexity of the problem. Surprisingly we are able to show a probabilistic, logspace algorithm solving the proble...
متن کاملUndirected ST-Connectivity in Log-Space PRELIMINARY VERSION
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log(·) obtained by Armoni, Ta-Shma, Wigderson and Zhou [ATSWZ00]. As undirected st-connectivity is complete for the class of problems solvable by symmetric, non-deterministic, log-space computations (the class SL), this al...
متن کاملUndirected Connectivity in O(log ^1.5 n) Space
We present a deterministic algorithm for the con-nectivity problem on undirected graphs that runs in O(log 1:5 n) space. Thus, the recursive doubling technique of Savich which requires (log 2 n) space is not optimal for this problem.
متن کاملLecture Space-Bounded Derandomization
We now prove Theorem 1. Let M be a probabilistic machine running in space S (and time 2S), using R random bits, and deciding a language L with two-sided error. (Note that S, R are functions of the input length n, and the theorem requires S = Ω(log n).) We will assume without loss of generality that M always uses exactly R random bits on all inputs. Fixing an input x and letting ` be some parame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2021
ISSN: ['1095-7111', '0097-5397']
DOI: https://doi.org/10.1137/20m134109x